Higher-order theorem proving and its applications
نویسندگان
چکیده
منابع مشابه
Higher-Order Automated Theorem Proving
The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification...
متن کاملApplication Specific Higher Order Logic Theorem Proving
Theorem proving allows the formal verification of the correctness of very large systems. In order to increase the acceptance of theorem proving systems during the design process, we implemented higher order logic proof systems for ANSI-C and Verilog within a framework for application specific proof systems. Furthermore, we implement the language of the PVS theorem prover as well-established hig...
متن کاملHigher - Order Automated Theorem Proving for NaturalLanguage
This paper describes a tableau-based higher-order theorem prover Hot and an application to natural language semantics. In this application, Hot is used to prove equivalences using world knowledge during higher-order uniication (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.
متن کاملon Higher - Order Logic , Theorem Proving and itsApplications
This paper describes how to specify and reason about the properties of non-ideal logical circuitry in the analogue domain. Device behaviours are characterised by predicates over the voltage and current waveforms present at their ports. In many cases it suuces to formulate these predicates simply in terms of linear inequalities. The behavioural predicate for an overall circuit is obtained by tak...
متن کاملHigher-Order Logic and Theorem Proving for Structured Specifications
In this paper we present the higher-order logic used in theorem-provers like the HOL system (see [GM 93]) or Isabelle HOL logic (see [Paul 94]) as an institution. Then we show that for maps of institutions into HOL that satisfy certain technical conditions we can reuse the proof system of the higher-order logic to reason about structured specifications built over the institutions mapped into HO...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: it - Information Technology
سال: 2019
ISSN: 2196-7032,1611-2776
DOI: 10.1515/itit-2019-0001